Border basis relaxation for polynomial optimization
نویسندگان
چکیده
منابع مشابه
An exact Jacobian SDP relaxation for polynomial optimization
Given polynomials f(x), gi(x), hj(x), we study how to minimize f(x) on the set S = {x ∈ R : h1(x) = · · · = hm1(x) = 0, g1(x) ≥ 0, . . . , gm2(x) ≥ 0} . Let fmin be the minimum of f on S. Suppose S is nonsingular and fmin is achievable on S, which are true generically. This paper proposes a new type semidefinite programming (SDP) relaxation which is the first one for solving this problem exactl...
متن کاملConvex Relaxation Methods for Nonconvex Polynomial Optimization Problems
This paper introduces to constructing problems of convex relaxations for nonconvex polynomial optimization problems. Branch-and-bound algorithms are convex relaxation based. The convex envelopes are of primary importance since they represent the uniformly best convex underestimators for nonconvex polynomials over some region. The reformulationlinearization technique (RLT) generates LP (linear p...
متن کاملExploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems
We present a survey on the sparse SDP relaxation proposed as a sparse variant of Lasserre’s SDP relaxation of polynomial optimization problems. We discuss the primal and dual approaches to derive the sparse SDP and SOS relaxations, and their relationship. In particular, exploiting structured sparsity in the both approaches is described in view of the quality and the size of the SDP relaxations....
متن کاملSparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems
SparesPOP is a MATLAB implementation of a sparse semidefinite programming (SDP) relaxation method proposed for polynomial optimization problems (POPs) in the recent paper by Waki et al. The sparse SDP relaxation is based on “a hierarchy of LMI relaxations of increasing dimensions” by Lasserre, and exploits a sparsity structure of polynomials in POPs. The efficiency of SparsePOP to compute bound...
متن کاملExtension of Completely Positive Cone Relaxation to Polynomial Optimization
We propose the moment cone relaxation for a class of polynomial optimization problems (POPs) to extend the results on the completely positive cone programming relaxation for the quadratic optimization (QOP) model by Arima, Kim and Kojima. The moment cone relaxation is constructed to take advantage of sparsity of the POPs, so that efficient numerical methods can be developed in the future. We es...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2016
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2015.08.004